| 翻訳と辞書 |
Gil Kalai
Gil Kalai (born 1955) is the Henry and Manya Noskwith Professor of Mathematics at the Hebrew University of Jerusalem, and adjunct professor of mathematics and of computer science at Yale University.〔
==Biography==
Gil Kalai received his Ph.D. from Hebrew University in 1983, under the supervision of Micha Perles,〔.〕 and joined the Hebrew University faculty in 1985 after a postdoctoral fellowship at the Massachusetts Institute of Technology.〔(Profile at the Technical University of Eindhoven ) as an instructor of a minicourse on polyhedral combinatorics.〕 He was the recipient of the Pólya Prize in 1992, the Erdős Prize of the Israel Mathematical Society in 1993, and the Fulkerson Prize in 1994.〔(Profile at Yale CS department ).〕 He is known for finding variants of the simplex algorithm in linear programming that can be proven to run in subexponential time,〔.〕 for showing that every monotone property of graphs has a sharp phase transition,〔.〕 for solving Borsuk's problem (known as Borsuk's conjecture) on the number of pieces needed to partition convex sets into subsets of smaller diameter,〔.〕 and for his work on the Hirsch conjecture on the diameter of convex polytopes and in polyhedral combinatorics more generally.〔.〕
He was the winner of the 2012 Rothschild Prize in mathematics.〔Yad Hanadiv, (Rothschild Prize ).〕 From 1995 to 2001, he was the Editor-in-Chief of the Israel Journal of Mathematics.
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Gil Kalai」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|